منابع مشابه
On inverse permutation polynomials
We give an explicit formula of the inverse polynomial of a permutation polynomial of the form xrf(xs) over a finite field Fq where s | q − 1. This generalizes results in [6] where s = 1 or f = g q−1 s were considered respectively. We also apply our result to several interesting classes of permutation polynomials.
متن کاملRemarks on a family of permutation polynomials
We study a family of permutations of the finite field Fqn given by x + γ f(x), where γ ∈ Fqn and f : Fqn → Fq. In particular, we determine the cycle structure and the inverse of such a permutation.
متن کاملOn the degree of local permutation polynomials∗
Every Latin square of prime or prime power order s corresponds to a polynomial in 2 variables over the finite field on s elements, called the local permutation polynomial. What characterizes this polynomial is that its restrictions to one variable are permutations. We discuss the general form of local permutation polynomials and prove that their total degree is at most 2s−4, and that this bound...
متن کاملRemarks on Self-Inverse Quadratic Permutation Polynomials
Conditions for a quadratic permutation polynomial (QPP) to be self-inverse over the ring Zm of modular integers are given. If m = 2n, necessary and sufficient conditions for a QPP to be self-inverse are determined. Additional properties of QPP over modular integers as well as examples of monomial permutation polynomials are also provided. Mathematics Subject Classification: 12E10, 11B83
متن کاملOn permutation polynomials of prescribed shape
We count permutation polynomials of Fq which are sums of m+1(≥ 2) monomials of prescribed degrees. This allows us to prove certain results about existence of permutation polynomials of prescribed shape.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2002
ISSN: 1071-5797
DOI: 10.1006/ffta.2001.0342